# acyclic set

- 非循环序集(计算机的)

*English-Chinese electricity dictionary (电气专业词典).
2013.*

### Look at other dictionaries:

**Acyclic coloring**— In graph theory, an acyclic coloring is a (proper) vertex coloring in which every 2 chromatic subgraph is acyclic.The acyclic chromatic number A( G ) of a graph G is the least number of colors needed in any acyclic coloring of G .Some properties… … Wikipedia**Directed acyclic graph**— An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia**Feedback arc set**— In graph theory, a directed graph may contain directed cycles, a one way loop of edges. In some applications, such cycles are undesirable, and we wish to eliminate them and obtain a directed acyclic graph (DAG). One way to do this is simply to… … Wikipedia**Partially ordered set**— The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… … Wikipedia**Causal set theory bibliography**— Main article: Causal Sets This Causal Set Theory Bibliography is intended to aid causal set research. It gathers together academic papers, books, talks and PhD theses related to causal set theory and is intended to help readers find references… … Wikipedia**Feedback vertex set**— In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In other words, each feedback vertex set contains at least one vertex of any cycle in the graph.… … Wikipedia**Directed acyclic word graph**— For the US Department of Defense review panel, see Deputy’s Advisory Working Group. The strings tap , taps , top , and tops stored in a Trie (left) and a DAWG (right), EOW stands for End of word. In computer science, a directed acyclic word graph … Wikipedia**directed acyclic word graph**— noun A data structure that represents a set of strings and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length (thus more efficient in some situations than a trie). Syn: DAWG … Wiktionary**Decomposition method (constraint satisfaction)**— In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia**Glossary of graph theory**— Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia**Nakamura number**— In cooperative game theory and social choice theory, the Nakamura number measures the degree of rationality of preference aggregation rules (collective decision rules), such as voting rules. It is an indicator of the extent to which an… … Wikipedia